Secrecy in Security Protocols as Non Interference
نویسندگان
چکیده
Non Interference 8] has been proposed for modelling and analysing information ow in systems. In 4,7] we have indeed shown that the Non Interference property called NDC can be applied also in the area of network security, for the analysis of typical cryptographic protocol properties (e.g., authentication, non-repudiation). In this paper we extend the results of 4,7] by showing that NDC can be also easily adapted to detect secrecy attacks over networks.
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملOn The Secrecy of the Cognitive Interference Channel with Channel State
In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...
متن کاملProving Abstract Non-interference
In this paper we introduce a compositional proof-system for certifying abstract non-interference in programming languages. Certifying abstract noninterference means proving that no unauthorized flow of information is observable by the attacker from confidential to public data. The properties of the computation that an attacker may observe are specified as an abstract domain. Assertions specify ...
متن کاملConfidential Safety via Correspondence Assertions
We study a notion of secrecy that arises naturally in adversarial systems. Let all agents agree on a space of possible values. An honest agent chooses one of these values, and aims to make sure that this particular choice cannot be reliably guessed by an adversary, even in the context of a distributed protocol. An example is an agent that uses an honest mail server to send a message, wishing to...
متن کاملDecidability and Complexity Results for Security Protocols
Security protocols are prescribed sequences of interactions between entities designed to provide various security services across distributed systems. Security protocols are often wrong due to the extremely subtle properties they are supposed to ensure. Deciding whether or not a security protocol assures secrecy is one of the main challenge in this area. In this paper we survey the most importa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 32 شماره
صفحات -
تاریخ انتشار 2000